
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 1525. -- [POI2006]Zos -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>1525: [POI2006]Zos</h2><span class=green>Time Limit: </span>50 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>259 MB<br><span class=green>Submit: </span>83&nbsp;&nbsp;<span class=green>Solved: </span>22<br>[<a href='submitpage.php?id=1525'>Submit</a>][<a href='problemstatus.php?id=1525'>Status</a>][<a href='bbs.php?id=1525'>Discuss</a>]</center><h2>Description</h2><div class=content>给出一个N个点M条边的无向图G，定义图G的一个独立集为一个顶点集合V’，满足V’∈V，并且对于任何a∈V’且b∈V’的a和b，不存在(a,b)∈E。
问是否存在顶点个数不小于K的独立集，如果存在，找出顶点个数最多的独立集。
</div><h2>Input</h2><div class=content>
第一行两个正整数N (2 <= N <= 1,000,000)、K (N-10 <= K <= N)。第二行一个正整数M (1 <= M <= 3,000,000)。接着M行，每行两个正整数a和b (1 <= a, b <= N, a ≠ b)，表示一条边。（注意同样的边可能多次出现）
</div><h2>Output</h2><div class=content>如果不存在顶点个数不小于K的独立集，就输出NIE，否则输出最大独立集的顶点个数。
</div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>9 4<br />
12<br />
9 6<br />
4 6<br />
7 9<br />
1 2<br />
2 1<br />
9 7<br />
7 6<br />
4 5<br />
7 8<br />
8 9<br />
3 4<br />
4 3<br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>5</span></div><h2>HINT</h2>
			<div class=content><p>最大独立集为{1, 3, 5, 6, 8}。<br />
<br />
==================================<br />
鸣谢Oimaster</p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search='></a></p></div><center>[<a href='submitpage.php?id=1525'>Submit</a>][<a href='problemstatus.php?id=1525'>Status</a>][<a href='bbs.php?id=1525'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
